LMR and LTE for Public Safety in 700 MHz Spectrum

This paper presents a concise overview of current public safety communication networks known as LMR (Land Mobile Radio) and emerging LTE-(Long-Term Evolution-) based broadband public safety networks to be deployed in the 700 MHz band. A broadband nationwide network for public safety based on LTE is inevitable where shared or dedicated types of LTE-based public safety networks are possible. Current LTE services do not meet mission-critical requirements and several enhancements have been defined by 3GPP to address this in Releases 12 and 13. First responders are familiar with LMR and consider it to be a reliable technology with massive deployment everywhere. Therefore, it is expected that LMR will continue to exist alongside any new LTE-based broadband public safety network. Recent LTE releases (particularly Release 15) addressed the LMR-LTE interoperability issue and described comprehensive interworking facilities. New and upcoming features and services of LTE in Releases 14 and 15, such as mission-critical data, mission-critical video, and aerial user equipments, are also directly applicable to public safety. The paper endeavours to provide a quick yet meaningful review of all these issues. It also offers a look ahead at the new and rapidly advancing virtualization technologies, such as software-defined radio access network, and radio access network slicing, as enablers for future public safety networks

Improving throughput and fairness by improved channel assignment using topology control based on power control for multi-radio multichannel wireless mesh networks

Multi-radio multi-channel (MRMC) wireless mesh networks (WMNs) achieve higher throughput using multiple simultaneous transmissions and receptions. However, due to limited number of non-overlapping channels, such networks suffer from co-channel interference, which degrades their performance. To mitigate co-channel interference, effective channel assignment algorithms (CAAs) are desired. In this article, we propose a novel CAA, Topology-controlled Interference-aware Channel-assignment Algorithm (TICA), for MRMC WMNs. This algorithm uses topology control based on power control to assign channels to multi-radio mesh routers such that co-channel interference is minimized, network throughput is maximized, and network connectivity is guaranteed. We further propose to use two-way interference-range edge coloring, and call the improved algorithm Enhanced TICA (e-TICA), which improves the fairness among flows in the network. However, the presence of relatively long links in some topologies leads to conflicting channel assignments due to their high interference range. To address this issue, we propose to utilize minimum spanning tree rooted at the gateway to reduce conflicting channels, and in turn, improve medium access fairness among the mesh nodes. We call the improved algorithm e-TICA version 2 (e-TICA2). We evaluate the performance of the proposed CAAs using simulations in NS2. We show that TICA significantly outperforms the Common Channel Assignment scheme in terms of network throughput, and e-TICA and e-TICA2 achieve better fairness among traffic flows as compared to TICA. It is also shown that e-TICA2 leads to improved network throughput, as compared to TICA and e-TICA

On the number of channels required for interference-free wireless mesh networks

We study the problem of achieving maximum network throughput with fairness among the flows at the nodes in a wireless mesh network, given their location and the number of their half-duplex radio interfaces. Our goal is to find the minimum number of non-overlapping frequency channels required to achieve interference-free communication. We use our existing Select x for less than x topology control algorithm (TCA) to build the connectivity graph (CG), which enhances spatial channel reuse to help minimize the number of channels required. We show that the TCA-based CG approach requires fewer channels than the classical approach of building the CG based on the maximum power. We use multi-path routing to achieve the maximum network throughput and show that it provides better network throughput than the classical minimum power-based shortest path routing. We also develop an effective heuristic method to determine the minimum number of channels required for interference-free channel assignment